An Extended Relational Algebra for Declarative Programming
نویسنده
چکیده
Relational algebra is a well-known formalism for expressing queries against a relational database. In this paper we will present a relational algebra for declarative languages. It is based in the use of the operators of projection, selection, renaming, cross product, union and join. This relational algebra can be used for dening predicates and functions for a declarative language, and in general for de ning clauses and rewriting rules. Finally, we will present a SQL-based syntax based on this relational algebra.
منابع مشابه
Designing and Prototyping Data-Intensive Applications in the Logres and Algres Programming Environment
This paper presents an environment and a methodology for the design and rapid prototyping of data-intensive software applications; i.e., applications which perform substantial retrieval and update activity on persistent data. In the proposed approach, the application is formally specified using Logres, a database language which combines object-oriented data modeling and rule-based programming. ...
متن کاملDeclarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کاملkLogNLP: Graph Kernel-based Relational Learning of Natural Language
kLog is a framework for kernel-based learning that has already proven successful in solving a number of relational tasks in natural language processing. In this paper, we present kLogNLP, a natural language processing module for kLog. This module enriches kLog with NLP-specific preprocessors, enabling the use of existing libraries and toolkits within an elegant and powerful declarative machine ...
متن کاملImplementing Relational Specifications in a Constraint Functional Logic Language
We show how the algebra of (finite, binary) relations and the features of the integrated functional logic programming language Curry can be employed to solve problems on relational structures (like orders, graphs, and Petri nets) in a very high-level declarative style. The functional features of Curry are used to implement relation algebra and the logic features of the language are combined wit...
متن کاملGlobal Optimization and Parallelization of Integrity Constraint Checks
In this paper we consider the problem of eeciently checking integrity constraints. We concentrate on a combination of two optimization techniques: global optimization and parallelization. The primary objective of global optimization is to produce a global execution plan for a group of constraints where common subexpressions can be shared. Since parallelism is a promising strategy for improving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007